Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems

We associate with every commutative continuous semiring S and alphabet Σ a category whose objects are all sets and a morphism X → Y is determined by a function from X into the semiring of formal series S⟪(Y ⊎Σ) ⟫ of finite words over Y ⊎Σ, an X × Y -matrix over S⟪(Y ⊎Σ) ⟫, and a function from X into the continuous S⟪(Y ⊎Σ) ⟫-semimodule S⟪(Y ⊎Σ) ⟫ of series of ωwords over Y ⊎Σ. When S is also an ω-semiring (equipped with an infinite product operation), then we define a fixed point operation over our category and show that it satisfies all identities of iteration categories. We then use this fixed point operation to give semantics to recursion schemes defining series of finite and infinite words. In the particular case when the semiring is the Boolean semiring, we obtain the context-free languages of finite and ω-words.